Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
991	Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-02 11:07:07 Complexity classes Mathematical optimization Structural complexity theory Computational resources P versus NP problem NP-complete Circuit complexity P Time hierarchy theorem Theoretical computer science Computational complexity theory Applied mathematics
992	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:49:01 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity NP-complete Vertex cover Time complexity Travelling salesman problem Matching Theoretical computer science Computational complexity theory Applied mathematics
993	Microsoft Word - GZBriefing paper - Social problems and impact2011.doc Add to Reading List Source URL: www.csi.edu.au Language: English - Date: 2014-12-09 22:56:07 Mind Psychology Holism Systems Positive psychology Complexity Computational complexity theory Intelligence quotient Social complexity Science Complex systems theory Popular psychology
994	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
995	Fixed-Parameter Algorithms for Covering Points with Lines Apichat Heednacram PhD Student Supervisors: Prof. Vladimir Estivill-Castro Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:27 Parameterized complexity Analysis of algorithms Time complexity NP-complete problems Algorithm Theoretical computer science Applied mathematics Computational complexity theory
996	Parameterized Complexity in Practice Luke Mathieson Parameterized Complexity in Practice Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:24 Network analysis Parameterized complexity K-means clustering Complexity Consensus clustering Cluster analysis Statistics Computational statistics Hierarchical clustering
997	Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:19:59 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Feedback vertex set Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
998	Local Search for String Problems: Brute Force is Essentially Optimal Jiong Guo, Danny Hermelin, Christian Komusiewicz Universit¨ at des Saarlandes, Ben-Gurion University, TU Berlin & Universit´ Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2013-07-26 10:03:32 Coding theory Analysis of algorithms Computational complexity theory Closest string Hamming distance Time complexity Algorithmica Theoretical computer science Applied mathematics NP-complete problems
999	Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:47:38 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Graph coloring Bidimensionality Kernelization Clique Dominating set Theoretical computer science Graph theory Computational complexity theory
1000	THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-11-25 03:18:59 Complexity classes Mathematical optimization Structural complexity theory Computability theory P versus NP problem NP-complete NP PP Analog computer Theoretical computer science Computational complexity theory Applied mathematics

UPDATE